Priority tandem queueing model with admission control
نویسندگان
چکیده
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.03.003 q This manuscript was handled by area editor Jame ⇑ Corresponding author. E-mail addresses: [email protected] (C. Kim), du A two-stage multi-server tandem queue with two types of processed customers is analyzed. The input is described by the Marked Markovian Arrival Process (MMAP). The first stage has an infinite number of servers while the second stage has a finite number of servers. The service time at the both stages has an exponential distribution. Priority customers are always admitted to the system. Non-priority customers are admitted to the system only if the number of busy servers at the second stage does not exceed some pre-assigned threshold. Queueing system’s behavior is described in terms of the multi-dimensional asymptotically quasi-Toeplitz continuous time Markov chain. It allows to exploit a numerically stable algorithm for calculation of the stationary distribution of the queueing system. The loss probability at the both stages of the tandem is computed. An economic criterion of the system operation is optimized with respect to the threshold. The effect of control on the main performance measures of the system is numerically demonstrated. 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
A Tandem Queueing Network with Feedback Admission Control
Admission control in queueing networks is often based on partial information on the network state. This paper studies how the lack of state information affects performance by considering a simple model for admission control. The model is analyzed by studying a related censored process that has a matrix-geometric steady-state distribution. Numerical results show how partial information may cause...
متن کاملPer-flow guarantees under class-based priority queueing
In this paper, we present an admission control scheme which provides per-flow delay and bandwidth guarantees based solely upon simple class-based strict priority queue-ing. We derive basic properties of the worst-case behaviour in strict priority queueing systems using network calculus. Building upon these properties the flow admission control scheme is devised. The rationale behind this work i...
متن کاملAn Anti-blocking Control Policy for Tandem Queueing Networks
Blocking phenomena may appear in any queueing network with limited capacity queues. We propose a simple admission control policy, to decrease the risks of blocking which deteriorate the system performance. Under classical Markov assumptions, the controlled system is exactly modelled in the case of two tandem queues, and approximately modelled for more than two queues. The quality of the approxi...
متن کاملAdmission control of multi-class traffic with service priorities in high-speed networks
We consider a fluid model of a system that handles multiple classes of traffic. The delay and cell-loss requirements of the different classes of traffic are generally widely different and are achieved by assigning different buffers for different classes, and serving them in a strict priority order. We use results from the effective bandwidth of the output processes (see Chang and Thomas (1995))...
متن کاملPacket Models Revisited: Tandem and Priority Systems
We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 61 شماره
صفحات -
تاریخ انتشار 2011